Maximum chromatic polynomial of 3-chromatic blocks

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximating the Chromatic Polynomial

Chromatic polynomials are important objects in graph theory and statistical physics, but as a result of computational difficulties, their study is limited to graphs that are small, highly structured, or very sparse. We have devised and implemented two algorithms that approximate the coefficients of the chromatic polynomial P (G,x), where P (G, k) is the number of proper k-colorings of a graph G...

متن کامل

Boundary chromatic polynomial

We consider proper colorings of planar graphs embedded in the annulus, such that vertices on one rim can take Qs colors, while all remaining vertices can take Q colors. The corresponding chromatic polynomial is related to the partition function of a boundary loop model. Using results for the latter, the phase diagram of the coloring problem (with real Q and Qs) is inferred, in the limits of two...

متن کامل

The Chromatic Polynomial

It is shown how to compute the Chromatic Polynomial of a simple graph utilizing bond lattices and the Möbius Inversion Theorem, which requires the establishment of a refinement ordering on the bond lattice and an exploration of the Incidence Algebra on a partially ordered set.

متن کامل

Chromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs

In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...

متن کامل

Categorifications of the chromatic polynomial

We will discuss different categorifications of the chromatic polynomial, how they are related to each other as well as how they relate to the Hochschild homology of algebras and Khovanov link homology.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1997

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(96)00276-2